package leetcode.code0081;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution81 implements IDebug {

	public abstract boolean search(int[] nums, int target);

	@Override
	public void debug1() {
		boolean r = this.search(HelpDebug.str2array3("[2,5,6,0,0,1,2]"), 0);
		boolean e = true;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		boolean r = this.search(HelpDebug.str2array3("[2,5,6,0,0,1,2]"), 3);
		boolean e = false;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		boolean r = this.search(HelpDebug.str2array3("[4,5,6,6,7,0,1,2,4,4]"), 8);
		boolean e = false;
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug4() {
		boolean r = this.search(HelpDebug.str2array3("[4,4,6,6,7,0,1,2,4,4]"), 5);
		boolean e = false;
		HelpDebug.compare(e, r);
	}
	public void debug5() {
		boolean r = this.search(HelpDebug.str2array3("[5]"), 5);
		boolean e = true;
		HelpDebug.compare(e, r);
	}
	public void debug6() {
		boolean r = this.search(HelpDebug.str2array3("[1]"), 1);
		boolean e = true;
		HelpDebug.compare(e, r);
	}
	public void debug7() {
		boolean r = this.search(HelpDebug.str2array3("[1,1,1,3]"), 0);
		boolean e = false;
		HelpDebug.compare(e, r);
	}

}
